Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at

Source URL: www.pepper-project.org

• Computational complexity theory
• Logic
• Mathematics
• Randomized algorithms
• Automated theorem proving
• Logic programming
• Probabilistically checkable proof
• IP
• NP
• Substitution
• MAX-3SAT
• operator

Efficient Multi-Party Computation: from Passive to Active Security via Secure SIMD Circuits Daniel Genkin12 , Yuval Ishai1 , and Antigoni Polychroniadou3 1

Source URL: web.eecs.umich.edu

• Cryptographic protocols
• Mathematics
• Secure multi-party computation
• Linear algebra
• Valuation
• Linear combination
• Finite field

SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldn’t fit)1 University of Bath, LORIA, Fo

Source URL: staff.bath.ac.uk

• Theoretical computer science
• Logic
• Logic in computer science
• Mathematics
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Uninterpreted function
• Satisfiability
• Solver

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation

Source URL: acmccs.github.io

S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing

Source URL: acmccs.github.io

THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES GIL KALAI HEBREW UNIVERSITY OF JERUSALEM AND YALE UNIVERSITY Abstract. In this lecture I will talk about three mathematical puzzles involving mathematics and computati

Source URL: eta.impa.br

• Computational complexity theory
• Mathematics
• Theoretical computer science
• Complexity classes
• Analysis of algorithms
• Quantum computing
• Linear programming
• Simplex algorithm
• Quantum algorithm
• P versus NP problem
• Quantum supremacy
• Time complexity

Verifying the Floating-Point Computation Equivalence of Manually and Automatically Differentiated Code — 1st International Workshop on Software Correctness for HPC Applications, Nov 12, 2017, CO, USA

Source URL: correctness-workshop.github.io

• Computing
• Software engineering
• Computer programming
• X86 instructions
• MOVAPD
• X86 instruction listings
• J
• Compiler
• MOVDDUP

Reachability Computation for Switching Diffusions: Finite Abstractions with Certifiable and Tuneable Precision Alessandro Abate Luca Bortolussi

Source URL: qav.comlab.ox.ac.uk

SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces ´ Erika Abrah´ am1 , John Abbott10 , Bernd Becker2 , Anna M. Bigatti3 , Martin Brain9 , Alessandro Cimatti4 , James H. Davenport5 ,

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Logic in computer science
• Computational complexity theory
• Formal methods
• Mathematics
• Electronic design automation
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Model checking

CS 294 – Secure Computation February 16 and 18, 2016 Lecture 9 and 10: Malicious Security - GMW Compiler and Cut and Choose, OT Extension

Source URL: people.eecs.berkeley.edu

• Cryptographic protocols
• Electromagnetism
• Garbled circuit
• Secure multi-party computation
• IP
• Theory of computation
• NC
• Electronic circuit
• Applied mathematics
• Commitment scheme